Valid inequalities and branch-and-cut for the clique pricing problem
نویسندگان
چکیده
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation network. Following a proof that clique pricing is NP-hard, we propose strong valid inequalities, some of which define facets of the 2-commodity polyhedron. The numerical efficiency of these inequalities is assessed by embedding them within a branch-and-cut framework.
منابع مشابه
Coordinated cutting plane generation via multi-objective separation
In cutting plane methods, the question of how to generate the “best possible” set of cuts is both central and crucial. We propose a lexicographic multi-objective cutting plane generation scheme that generates, among all the maximally violated valid inequalities of a given family, an inequality that is undominated and maximally diverse w.r.t. the cuts that were previously found. By optimizing a ...
متن کاملClique Inequalities Applied to the Vehicle Routing Problem with Time Windows
This work presents an exact branch-cut-and-price (BCP) algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It is shown how these cutting planes affect the dominance criterion applied in the pricing algorithm, which is a labeling algorithm for solving the ...
متن کاملBranch-and-Cut Algorithms for Independent Set Problems: Integrality Gap and an Application to Protein Structure Alignment
We discuss the effectiveness of branch and cut for solving large instances of the independent set problem. Typical LP formulations, even strengthened by clique inequalities, yield poor bounds for this problem. We prove that a strong bound is obtained by the use of the so called “rank inequalities”, which generalize the clique inequalities. For some problems the clique inequalities imply the ran...
متن کاملPolyhedral study of the maximum common induced subgraph problem
In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem (MCIS) by addressing it directly, using Integer Programming (IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalities, some of which we prove to define facets. Besides, we show an equivalence between our IP model for MCIS and a well-known formulation for the Ma...
متن کاملNew facets and a branch-and-cut algorithm for the weighted clique problem
We consider a polyhedral approach to the weighted maximal b-clique problem. Given a nodeand edge-weighted complete graph the problem is to find a complete subgraph (clique) with no more than b nodes such that the sum of the weights of all nodes and edges in the clique is maximal. We introduce four new classes of facet defining inequalities for the associated bclique polytope. One of these inequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 8 شماره
صفحات -
تاریخ انتشار 2011